A Class of Explicitly Solvable Vehicle Motion Problems
نویسندگان
چکیده
منابع مشابه
A Class of Solvable Consistent Labeling Problems
The structural description ansatz often used for representing and recognizing complex objects leads to the consistent labeling problem or to some optimization problems on labeled graphs. Although this problems are NP-complete in general it is well known that they are easy solvable if the underlying graph is a tree or even a partial m-tree (i.e its treewidth is m). On the other hand the underlyi...
متن کاملA Class of Exactly-Solvable Eigenvalue Problems
The class of differential-equation eigenvalue problems −y′′(x)+x2N+2y(x) = xNEy(x) (N = −1, 0, 1, 2, 3, . . .) on the interval −∞ < x < ∞ can be solved in closed form for all the eigenvalues E and the corresponding eigenfunctions y(x). The eigenvalues are all integers and the eigenfunctions are all confluent hypergeometric functions. The eigenfunctions can be rewritten as products of polynomial...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملRandom string: an explicitly solvable model
We calculate exactly the Lyapunov exponent and the integrated density of states for the random string operator whose density and elastic compliance are functions of a binary Markov chain. For all values of interest short and long wave asymptotic expansions are obtained. Finally we discuss conditions of propagation and localization of waves in a binary random medium.
متن کاملA Class of Linear Complementarity Problems Solvable in Polynomial Time
We describe a “condition” number for the linear complementarity problem (LCP), which characterizes the degree of difficulty for its solution when a potential reduction algorithm is used. Consequently, we develop a class of LCPs solvable in polynomial time. The result suggests that the convexity (or positive semidefiniteness) of the LCP may not be the basic issue that separates LCPs solvable and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2015
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2015.2426471